A Multi-Objective Variable Neighborhood Search Algorithm for Precast Production Scheduling
نویسندگان
چکیده
منابع مشابه
Multi-objective Variable Neighborhood Search Algorithms for a Single Machine Scheduling Problem with Distinct due Windows
In this paper, we compare three multi-objective algorithms based on Variable Neighborhood Search (VNS) heuristic. The algorithms are applied to solve the single machine scheduling problem with sequence dependent setup times and distinct due windows. In this problem, we consider minimizing the total weighted earliness/tardiness and the total flowtime criteria. We introduce two intensification pr...
متن کاملA multi-objective mathematical model for production-distribution scheduling problem
With increasing competition in the business world and the emergence and development of new technologies, many companies have turned to integrated production and distribution for timely production and delivery at the lowest cost of production and distribution and with the least delay in delivery. By increasing human population and the increase in greenhouse gas emissions and industrial waste, in...
متن کاملA Novel Variable Neighborhood Genetic Algorithm for Multi-objective Flexible Job-Shop Scheduling Problems
Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine. It is quite difficult to achieve optimal or near-optimal solutions with single traditional optimization approach because the multi objective FJSP has the high computational complexity. An novel hybrid algorithm ...
متن کاملA hybrid variable neighborhood search algorithm for solving multi-objective flexible job shop problems
In this paper, we propose a novel hybrid variable neighborhood search algorithm combining with the genetic algorithm (VNS+GA) for solving the multi-objective flexible job shop scheduling problems (FJSPs) to minimize the makespan, the total workload of all machines, and the workload of the busiest machine. Firstly, a mix of two machine assignment rules and two operation sequencing rules are deve...
متن کاملMulti-objective scheduling of dynamic job shop using variable neighborhood search
Dynamic job shop scheduling that considers random job arrivals and machine breakdowns is studied in this paper. Considering an event driven policy rescheduling, is triggered in response to dynamic events by variable neighborhood search (VNS). A trained artificial neural network (ANN) updates parameters of VNS at any rescheduling point. Also, a multi-objective performance measure is applied as o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Journal
سال: 2020
ISSN: 0125-8281
DOI: 10.4186/ej.2020.24.6.139